Learning from planner performance

نویسندگان

  • Mark Roberts
  • Adele E. Howe
چکیده

a r t i c l e i n f o a b s t r a c t The planning community has amassed a large body of publicly available problems in a standardized input language and planners that accept the language. We seized this remarkable opportunity to collect data about how some of these planners perform on the benchmark problems. We analyzed the resulting data to learn about the state of the art in Classical planning. Our analyses are retrospective, prescriptive and prospective. The first analyses are retrospective and prescriptive in that they characterize the problems and planners in terms of difficulty, diversity and trends over time. We statistically confirm that problem sets have become more difficult and that new planners are generally more capable. A visualization of planner success on domains shows how the domains distinguish performance. We also assess whether some older planners can be disregarded as outdated and find that while they are not up to current capabilities, some do provide limited distinct functionality. The second analyses automatically learn models of success and time for each planner. The models are constructed from easily extracted features of problems and domains and use off-the-shelf Machine Learning techniques. We find the models of success to be extremely accurate, but the models of time to be less so. They too are both retrospective and prescriptive in demonstrating the predictability of current planner performance. In a third analysis, we apply the data to an existing explanatory model linking the relationship between the search space and planner performance. Our study validates previous results linking search topology with planner performance on a wider set of planners than the original study. Finally, we fill in some gaps in observed performance of the benchmark problems by constructing new problems; these problems do turn out to be more challenging. This study of existing and new problems and planners is prescriptive and prospective in that the results should help guide researchers in comparatively evaluating their planners and suggest need for additional effort. These analyses highlight the importance of problems in driving research in planning. We show how much can be accomplished with the available resources and point out how much more can be done by broadening the problems available and by learning from what has already been done. 1. Assessing planning Developing a state of the art planning system requires tremendous effort. The systems are large – …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Application of Competitive Associative Nets to Plane Extraction from Range Data

This article describes an application of competitive associative net called CAN2 to plane extraction from 3D range images measured by a laser range finer (LRF). The CAN2 basically is a neural net which learns efficient piecewise linear approximation of nonlinear functions, and in this application it is utilized for learning piecewise planner (linear) surfaces from the range data. As a result of...

متن کامل

Machine Learning for Adaptive Planning

This chapter is concerned with the enhancement of planning systems using techniques from Machine Learning in order to automatically configure their planning parameters according to the morphology of the problem in hand. It presents two different adaptive systems that set the planning parameters of a highly adjustable planner based on measurable characteristics of the problem instance. The plann...

متن کامل

Using the k-Nearest Problems for Adaptive Multicriteria Planning

This paper concerns the design and development of an adaptive planner that is able to adjust its parameters to the characteristics of a given problem and to the priorities set by the user concerning plan length and planning time. This is accomplished through the implementation of the k nearest neighbor machine learning algorithm on top of a highly adjustable planner, called HAP. Learning data a...

متن کامل

Learned Models of Performance for Many Planners

We describe a large scale study of planners and their performance: 28 planners on 4726 benchmark problems. In the first part of the paper, we apply off-the-shelf machine learning techniques to learn models of the planners’ performance from the data. In the evaluation of these models, we address the critical question of whether accurate models can be learned from easily extractable problem featu...

متن کامل

Situation-Dependent Learning for Interleaved Planning and Robot Execution

This dissertation presents the complete integrated planning, executing and learning robotic agent Rogue. Physical domains are notoriously hard to model completely and correctly. Robotics researchers have developed learning algorithms to successfully tune operational parameters. Instead of improving low-level actuator control, our work focusses instead at the planning stages of the system. The t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Artif. Intell.

دوره 173  شماره 

صفحات  -

تاریخ انتشار 2009